Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems
نویسندگان
چکیده
منابع مشابه
Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems
Classical results in economics show that no truthful mechanism can achieve budget balance and efficiency simultaneously. Roughgarden and Sundararajan recently proposed an alternative efficiency measure, which was subsequently used to exhibit that many previously known cost sharing mechanisms approximate both budget balance and efficiency. In this work, we investigate cost sharing mechanisms for...
متن کاملOptimal group strategyproof cost sharing∗
Units of a good are produced at some symmetric cost. A mechanism elicits agents’ willingness to pay for one unit of the good, allocates some goods to some agents, and covers the cost by charging those agents. We introduce the generalized average cost mechanism (GAC) for arbitrary symmetric cost functions. GAC is the only Pareto selection among group strategyproof mechanisms that treat equal age...
متن کاملOn Budget-Balanced Group-Strategyproof Cost-Sharing Mechanisms
A cost-sharing mechanism defines how to share the cost of a service among serviced customers. It solicits bids from potential customers and selects a subset of customers to serve and a price to charge each of them. The mechanism is group-strategyproof if no subset of customers can gain by lying about their values. There is a rich literature that designs group-strategyproof cost-sharing mechanis...
متن کاملCost Sharing and Strategyproof Mechanisms for Set Cover Games
We develop for set cover games several general cost-sharing methods that are approximately budget-balanced, in the core, and/or group-strategyproof. We first study the cost sharing for a single set cover game, which does not have a budgetbalanced mechanism in the core. We show that there is no cost allocation method that can always recover more than 1 ln n of the total cost and in the core. Her...
متن کاملCost Sharing Methods for Makespan and Completion Time Scheduling
Roughgarden and Sundararajan recently introduced an alternative measure of efficiency for cost sharing mechanisms. We study cost sharing methods for combinatorial optimization problems using this novel efficiency measure, with a particular focus on scheduling problems. While we prove a lower bound of Ω(logn) for a very general class of problems, we give a best possible cost sharing method for m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2008
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.03.025